Strong Convergence in Stabilised Degenerate Convex Problems
نویسندگان
چکیده
منابع مشابه
Strong convergence of numerical solutions to degenerate variational problems
Numerical approximations of strongly degenerate variational problems of the form J(u) = /J F{u') + (u f)2 are considered, where F is assumed convex but may have intervals where F" = 0. It is shown that, in spite of the degeneracy, natural numerical approximations still converge in Wx -p . Rates in weaker norms and the connection with nonconvex variational problems are also considered.
متن کاملA posteriori error analysis of stabilised FEM for degenerate convex minimisation problems under weak regularity assumptions
*Correspondence: [email protected] 1Department of Mathematics, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany 2Department of Computational Science and Engineering, Yonsei University, Unter den Linden 6, 120-749, Seoul, Korea Abstract Background: The discretisation of degenerate convex minimisation problems experiences numerical difficulties with a singular or near...
متن کاملStrong convergence for variational inequalities and equilibrium problems and representations
We introduce an implicit method for nding a common element of the set of solutions of systems of equilibrium problems and the set of common xed points of a sequence of nonexpansive mappings and a representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit schemes to the unique solution of a variational inequality, which is the optimality condition for ...
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملConvergence of Adaptive Fem for a Class of Degenerate Convex Minimization Problems
A class of degenerate convex minimization problems allows for some adaptive finite element method (AFEM) to compute strongly converging stress approximations. The algorithm AFEM consists of successive loops of the form SOLVE→ ESTIMATE→ MARK→ REFINE and employs the bulk criterion. The convergence in L ′ (Ω;Rm×n) relies on new sharp strict convexity estimates of degenerate convex minimization pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2008
ISSN: 1617-7061
DOI: 10.1002/pamm.200810839